A Comparative Study on Fingerprint Matching Algorithms for EVM
نویسندگان
چکیده
منابع مشابه
A Comparative Study of Fingerprint Thinning algorithms
Thinning plays a very important role in the preprocessing phase of automatic fingerprint recognition/identification systems. The performance of minutiae extraction relies heavily on the quality of skeletons used. A good fingerprint thinning algorithm can depress image noise and promote the robustness of the minutiae extraction algorithm which helps improve the overall performance of the system....
متن کاملTriangulation and Genetic Algorithms for Fingerprint Matching
The use of fingerprints for identification is one of the most popular and promising biometric identity-verification methods, especially for daily personal authentication. In the later half of the seminar Pattern Recognition, we have reviewed literature concerning fingerprint verification in a few different aspects. Compared to other biometric data, to authenticate by fingerprint may be the most...
متن کاملComparative study of minutiae selection algorithms for ISO fingerprint templates
We address the selection of fingerprint minutiae given a fingerprint ISO template. Minutiae selection plays a very important role when a secure element (i.e. a smart-card) is used. Because of the limited capability of computation and memory, the number of minutiae of a stored reference in the secure element is limited. We propose in this paper a comparative study of 6 minutiae selection methods...
متن کاملA Comparative Study of Hierarchical Matching Algorithms for Face Recognition
The similarity measure based nearest neighbour classifier is commonly used in object recognition or retrieval systems. The result of a query in such a system is in general the images from the database whose descriptors are closest to the descriptor of the query image. An important issue in large scale recognition systems is the computational burden caused by measuring the similarity of the feat...
متن کاملA Comparative Study of Some Clustering Algorithms on Shape Data
Recently, some statistical studies have been done using the shape data. One of these studies is clustering shape data, which is the main topic of this paper. We are going to study some clustering algorithms on shape data and then introduce the best algorithm based on accuracy, speed, and scalability criteria. In addition, we propose a method for representing the shape data that facilitates and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Sciences and Applications
سال: 2013
ISSN: 2328-7268
DOI: 10.12691/jcsa-1-4-1